全文获取类型
收费全文 | 41272篇 |
免费 | 9362篇 |
国内免费 | 6450篇 |
专业分类
电工技术 | 1615篇 |
综合类 | 5265篇 |
化学工业 | 845篇 |
金属工艺 | 757篇 |
机械仪表 | 3572篇 |
建筑科学 | 1094篇 |
矿业工程 | 491篇 |
能源动力 | 273篇 |
轻工业 | 1117篇 |
水利工程 | 304篇 |
石油天然气 | 449篇 |
武器工业 | 534篇 |
无线电 | 10963篇 |
一般工业技术 | 3643篇 |
冶金工业 | 354篇 |
原子能技术 | 207篇 |
自动化技术 | 25601篇 |
出版年
2024年 | 194篇 |
2023年 | 944篇 |
2022年 | 1590篇 |
2021年 | 1947篇 |
2020年 | 1901篇 |
2019年 | 1475篇 |
2018年 | 1334篇 |
2017年 | 1719篇 |
2016年 | 1873篇 |
2015年 | 2246篇 |
2014年 | 2996篇 |
2013年 | 2812篇 |
2012年 | 3681篇 |
2011年 | 3708篇 |
2010年 | 3251篇 |
2009年 | 3209篇 |
2008年 | 3369篇 |
2007年 | 3558篇 |
2006年 | 2882篇 |
2005年 | 2528篇 |
2004年 | 2026篇 |
2003年 | 1615篇 |
2002年 | 1230篇 |
2001年 | 978篇 |
2000年 | 729篇 |
1999年 | 572篇 |
1998年 | 482篇 |
1997年 | 408篇 |
1996年 | 310篇 |
1995年 | 267篇 |
1994年 | 213篇 |
1993年 | 182篇 |
1992年 | 155篇 |
1991年 | 108篇 |
1990年 | 111篇 |
1989年 | 84篇 |
1988年 | 68篇 |
1987年 | 42篇 |
1986年 | 48篇 |
1985年 | 54篇 |
1984年 | 38篇 |
1983年 | 45篇 |
1982年 | 25篇 |
1981年 | 20篇 |
1980年 | 10篇 |
1979年 | 6篇 |
1965年 | 4篇 |
1964年 | 3篇 |
1960年 | 4篇 |
1959年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
介绍了煤矿地面轨道运输矿车自动避障技术。首先介绍了基于雷达的矿车前方障碍物检测技术及其相关算法,然后详细介绍了基于机器视觉的矿车前方障碍物检测系统和常用的图像处理方法以及相关的算法,最后介绍了雷达和机器视觉融合的障碍物检测技术在煤矿地面轨道运输矿车自动避障过程中的应用。 相似文献
32.
Simulating the psychological experience of human vision,a road extraction model based on the format tower is proposed to extract the road in the high resolution remote sensing image from the perspective of morphology.Firstly,based on the spectral and texture information,the suspected road targets are extracted by using segmentation technology.Then these targets are classified according to their reliability and extract the road targets for each category.Finally,three types of identified road information are verified and merged,and the continuous smooth road extraction results are obtained.Experiments on real high resolution images show that the results are consistent with the visual perception of the human eye,and the overall classification accuracy is higher,indicating that the algorithm is effective and feasible and has good use value. 相似文献
33.
随着计算机视觉技术在海洋水产领域中的应用不断加深,鱼类图像检索在渔业资源调查、鱼类行为学分析等方面发挥了巨大的作用。通过研究发现,鱼类图像的背景信息会对鱼类图像检索造成极大干扰,而且鱼类图像中颜色、纹理、形状等特征由于空间位置信息的缺乏而使检索的准确率不高。为解决以上问题,提出了一种新的基于颜色四通道及空间金字塔的鱼类图像检索算法。首先,提取视觉显著性图将鱼类图像的前景和背景分开,从而减少图像背景对检索的干扰;其次,为了使图像特征包含一定的空间位置信息,利用空间金字塔的理论对图像进行分割,在此基础上,将图像转为HSVG四通道图并提取SURF特征;;最后,得到检索结果。为验证所提算法的有效性,在QUT_fish_data数据集和DLOU_fish_data数据集上对算法的查全率、查准率与经典的HSVG算法和显著性分块算法进行对比:在两个数据集上查准率分别比传统的HSVG算法最多分别提高12%和5%,查全率最多分别提高7%和22%;比传统的显著性分块算法查准率最多分别提高15%和5%,查全率最多分别提高36%和22%;从而证明所提算法是有效的,能有效提升鱼类图像的检索效果。 相似文献
34.
Haibo Zhang Guohua Geng Kang Li Cheng Liu Yuqing Hou 《Journal of Modern Optics》2018,65(20):2278-2289
Cone-beam X-ray luminescence computed tomography (CB-XLCT) is an attractive hybrid imaging modality, and it has the potential of monitoring the metabolic processes of nanophosphors-based drugs in vivo. However, the XLCT imaging suffers from a severe ill-posed problem. In this work, a sparse nonconvex Lp (0?p?1) regularization was utilized for the efficient reconstruction for early detection of small tumour in CB-XLCT imaging. Specifically, we transformed the non-convex optimization problem into an iteratively reweighted scheme based on the L1 regularization. Further, an iteratively reweighted split augmented lagrangian shrinkage algorithm (IRW_SALSA-Lp) was proposed to efficiently solve the non-convex Lp (0?p?1) model. We studied eight different non-convex p-values (1/16, 1/8, 1/4, 3/8, 1/2, 5/8, 3/4, 7/8) in both 3D digital mouse experiments and in vivo experiments. The results demonstrate that the proposed non-convex methods outperform L2 and L1 regularization in accurately recovering sparse targets in CB-XLCT. And among all the non-convex p-values, our Lp(1/4?p?1/2) methods give the best performance. 相似文献
35.
The present study focuses on experimental investigation of through the thickness displacement and strain field in thin adhesive layer in single sided (unsymmetrical) patch repaired CFRP (carbon fiber reinforced polymer) panel under tensile load. Digital image correlation (DIC) technique is employed to acquire the displacement and strain (longitudinal, peel and shear) field. Experimental determination of shear transfer length based on shear strain field obtained from DIC is introduced to estimate the optimum overlap length which is an essential parameter in patch design for the repair of CFRP structures. Further, DIC experiment with magnified optics is performed to get an insight into complex and localized strain field over thin adhesive layer especially at critical zones leading to damage initiation. The failure mechanism, load displacement behavior, damage initiation and propagation are closely monitored using DIC. The influence of patch edge tapering on strain distribution in adhesive layer is also investigated. The DIC successfully captures the global and localized strain field at critical zones over thin adhesive layer and further helps in monitoring the damage based on strain anomalies. Strains are found to have maximum magnitude at the patch overlap edge and the shear strain level in adhesive layer is higher than the peel strain. Normal tapering increases the peel strain and has negligible influence on shear strain level in adhesive layer. The recommended overlap length is found to be consistent with the recommendation in the literature. Whole field strain pattern and the overlap length obtained from experiment are further compared with the finite element analysis results and they appear to be in good coherence. 相似文献
36.
ABSTRACTThis paper proposes the multiple-hypotheses image segmentation and feed-forward neural network classifier for food recognition to improve the performance. Initially, the food or meal image is given as input. Then, the segmentation is applied to identify the regions, where a particular food item is located using salient region detection, multi-scale segmentation, and fast rejection. Then, the features of every food item are extracted by the global feature and local feature extraction. After the features are obtained, the classification is performed for each segmented region using a feed-forward neural network model. Finally, the calorie value is computed with the aid of (i) food volume and (ii) calorie and nutrition measure based on mass value. The experimental results and performance evaluation are validated. The outcome of the proposed method attains 0.947 for Macro Average Accuracy (MAA) and 0.959 for Standard Accuracy (SA), which provides better classification performance. 相似文献
37.
Single image super resolution (SISR) is an important research content in the
field of computer vision and image processing. With the rapid development of deep
neural networks, different image super-resolution models have emerged. Compared to
some traditional SISR methods, deep learning-based methods can complete the superresolution tasks through a single image. In addition, compared with the SISR methods
using traditional convolutional neural networks, SISR based on generative adversarial
networks (GAN) has achieved the most advanced visual performance. In this review, we
first explore the challenges faced by SISR and introduce some common datasets and
evaluation metrics. Then, we review the improved network structures and loss functions
of GAN-based perceptual SISR. Subsequently, the advantages and disadvantages of
different networks are analyzed by multiple comparative experiments. Finally, we
summarize the paper and look forward to the future development trends of GAN-based
perceptual SISR. 相似文献
38.
针对在灰度图像着色领域中,传统算法信息提取率不高、着色效果不理想的问题,提出了基于密集神经网络的灰度图像着色算法,以实现改善着色效果,让人眼更好地观察图片信息的目的。利用密集神经网络的信息提取高效性,构建并训练了一个端到端的深度学习模型,对图像中的各类信息及特征进行提取。训练网络时与原图像进行对比,以逐渐减小网络输出结果的信息、分类等各类型的损失。训练完成后,只需向网络输入一张灰度图片,即可生成一张颜色饱满、鲜明逼真的彩色图片。实验结果表明,引入密集网络后,可有效改善着色过程中的漏色、细节信息损失、对比度低等问题,所提算法着色效果较基于VGG网络及U-Net、双流网络结构、残差网络(ResNet)等性能优异的先进着色算法而言取得了显著的改进。 相似文献
39.
以子块直方图彩色图像检索算法为基础, 分析了进一步利用图像空间相似信息的颜色匹配对检索算法的性能。在子块直方图的构成、直方图距离值的归类等方面提出了行之有效的改进方法;给出了子块大小、相似度阈值等参数选择的优化原则,使查准率、查全率等检索性能指标得到了较大的提高,得出了几个有用的结论并形成了实验系统。 相似文献
40.
A Lattice Approach to Image Segmentation 总被引:1,自引:0,他引:1
Jean Serra 《Journal of Mathematical Imaging and Vision》2006,24(1):83-130
After a formal definition of segmentation as the largest partition of the space according to a criterion σ and a function
f, the notion of a morphological connection is reminded. It is used as an input to a central theorem of the paper (Theorem
8), that identifies segmentation with the connections that are based on connective criteria. Just as connections, the segmentations can then
be regrouped by suprema and infima. The generality of the theorem makes it valid for functions from any space to any other
one. Two propositions make precise the AND and OR combinations of connective criteria.
The soundness of the approach is demonstrated by listing a series of segmentation techniques. One considers first the cases
when the segmentation under study does not involve initial seeds. Various modes of regularity are discussed, which all derive
from Lipschitz functions. A second category of examples involves the presence of seeds around which the partition of the space
is organized. An overall proposition shows that these examples are a matter for the central theorem. Watershed and jump connection
based segmentations illustrate this type of situation. The third and last category of examples deals with cases when the segmentation
occurs in an indirect space, such as an histogram, and is then projected back on the actual space under study.
The relationships between filtering and segmentation are then investigated. A theoretical chapter introduces and studies the
two notions of a pulse opening and of a connected operator. The conditions under which a family of pulse openings can yield a connected filter are clarified. The ability of segmentations
to generate pyramids, or hierarchies, is analyzed. A distinction is made between weak hierarchies where the partitions increase
when going up in the pyramid, and the strong hierarchies where the various levels are structured as semi-groups, and particularly
as granulometric semi-groups.
The last section is based on one example, and goes back over the controversy about “lattice” versus “functional” optimization.
The problem is now tackled via a case of colour segmentation, where the saturation serves as a cursor between luminance and
hue. The emphasis is put on the difficulty of grouping the various necessary optimizations into a single one. 相似文献